Linear programming with positive semi-definite matrices
نویسندگان
چکیده
منابع مشابه
Product of three positive semi-definite matrices
In [2], the author showed that a square matrix with nonnegative determinant can always be written as the product of five or fewer positive semi-definite matrices. This is an extension to the result in [1] asserting that every matrix with positive determinant is the product of five or fewer positive definite matrices. Analogous to the analysis in [1], the author of [2] studied those matrices whi...
متن کاملMatrices with Positive Definite Hermitian Part : Inequalities and Linear
The Hermitian and skew-Hermitian parts of a square matrix A are deened by H(A) (A + A)=2 and S(A) (A ? A)=2: We show that the function f(A) = (H(A ?1)) ?1 is convex with respect to the Loewner partial order on the cone of matrices with positive deenite Hermitian part. That is, for any matrices A and B with positive deenite Hermitian part ff(A) + f(B)g=2 ? f(fA + Bg=2) is positive semideenite: U...
متن کاملPositive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملA New Determinant Inequality of Positive Semi-Definite Matrices
A new determinant inequality of positive semidefinite matrices is discovered and proved by us. This new inequality is useful for attacking and solving a variety of optimization problems arising from the design of wireless communication systems. I. A NEW DETERMINANT INEQUALITY The following notations are used throughout this article. The notations [·] and [·] stand for transpose and Hermitian tr...
متن کاملPositive Semi-definite Programming Localization in Wireless Sensor Networks
We propose an algorithm to locate an object with unknown coordinates based on the positive semi-definite programming in the wireless sensor networks, assuming that the squared error of the measured distance follows Gaussian distribution. We first obtain the estimator of the object location; then transform the non-convex problem to convex one by the positive semi-definite relaxation; and finally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 1996
ISSN: 1024-123X,1563-5147
DOI: 10.1155/s1024123x96000452